منابع مشابه
Formal Security Proofs
The goal of the lecture is to present some aspects of formal security proofs of protocols. This is a wide area, and there is another lecture (by B. Banchet) on related topics. The idea is therefore to explain in depth one particular technique, that relies on deducibility constraints. We rely mainly on two introductory documents [8,14]. Actually, the current notes are the beginning of [8]. Here ...
متن کاملDevelopments in Formal Proofs
A proof assistant is interactive computer software that humans use to prepare scripts of mathematical proofs. These proof scripts can be parsed and verified directly from the fundamental rules of logic and the foundational axioms of mathematics. The technology underlying proof assistants and formal proofs has been under development for decades and grew out of efforts in the early twentieth cent...
متن کاملConstructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly concentrated around the expected value. Unlike the standard proofs, our proof does not use the method of higher moments, but rather uses a simple and intuitive counting argument. In addition, our proof is constructive ...
متن کاملMingling: mixed-integer rounding with bounds
Mixed-integer rounding (MIR) is a simple, yet powerful procedure for generating valid inequalities for mixed-integer programs. When used as cutting planes, MIR inequalities are very effective for mixed-integer programming problems with unbounded integer variables. For problems with bounded integer variables, however, cutting planes based on lifting techniques appear to be more effective. This i...
متن کاملCombining Automated Theorem Provers and Computer Algebra Systems for Generating Formal Proofs of Complexity Bounds
Over the past few years, the traditional separation between automated theorem provers and computer algebra systems has slowly been eroded as both sides venture into foreign territory. But despite recent progress, theorem provers still have difficulties with basic arithmetic while computer algebra system inherently produce “untrusted” results that are not easily verified. We were able to combine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2015
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-015-9339-z